Conditional Epistemic Planning
نویسندگان
چکیده
Recent work has shown that Dynamic Epistemic Logic (DEL) offers a solid foundation for automated planning under partial observability and non-determinism. Under such circumstances, a plan must branch if it is to guarantee achieving the goal under all contingencies (strong planning). Without branching, plans can offer only the possibility of achieving the goal (weak planning). We show how to formulate planning in uncertain domains using DEL and give a language of conditional plans. Translating this language to standard DEL gives verification of both strong and weak plans via model checking. In addition to plan verification, we provide a tableau-inspired algorithm for synthesising plans, and show this algorithm to be terminating, sound and complete.
منابع مشابه
Conditional Progressive Planning: A Preliminary Report
In this article we describe a conditional planner called ETLplan which is an extension of the sequential planner TLplan ETLplan is a progressive planner and it uses strategic knowledge encoded in an epistemic temporal logic to reduce its search space It utilizes an ad vanced representation of knowledge and action with a semantics based on the notion of an epistemic situation Besides presenting ...
متن کاملCooperative Epistemic Multi-Agent Planning for Implicit Coordination
Epistemic planning can be used for decision making in multi-agent situations with distributed knowledge and capabilities. Recently, Dynamic Epistemic Logic (DEL) has been shown to provide a very natural and expressive framework for epistemic planning. We extend the DEL-based epistemic planning framework to include perspective shifts, allowing us to define new notions of sequential and condition...
متن کاملDiagnostic Problem Solving via Planning with Ontic and Epistemic Goals
Diagnostic problem solving involves a myriad of reasoning tasks associated with the determination of diagnoses, the generation and execution of tests to discriminate diagnoses, and the determination and execution of actions to alleviate symptoms and/or their root causes. Fundamental to diagnostic problem solving is the need to reason about action and change. In this work we explore these myriad...
متن کاملBisimulation for Single-Agent Plausibility Models
Epistemic plausibility models are Kripke models agents use to reason about the knowledge and beliefs of themselves and each other. Restricting ourselves to the single-agent case, we determine when such models are indistinguishable in the logical language containing conditional belief, i.e., we define a proper notion of bisimulation, and prove that bisimulation corresponds to logical equivalence...
متن کاملStrategies and interactive beliefs in dynamic games
Interactive epistemology in dynamic games studies forms of strategic reasoning like backward and forward induction by means of a formal representation of players’ beliefs about each other, conditional on each history. Work on this topic typically relies on epistemic models where states of the world specify both strategies and beliefs. Strategies are conjunctions of behavioral conditionals of th...
متن کامل